Fundamental Regions for Certain Finite Groups in S 4
نویسندگان
چکیده
منابع مشابه
Examensarbete Algorithmic Construction of Fundamental Polygons for Certain Fuchsian Groups
The work of mathematical giants, such as Lobachevsky, Gauss, Riemann, Klein and Poincaré, to name a few, lies at the foundation of the study of the highly structured Riemann surfaces, which allow definition of holomorphic maps, corresponding to analytic maps in the theory of complex analysis. A topological result of Poincaré states that every path-connected Riemann surface can be realised by a ...
متن کاملFinite subnormal coverings of certain solvable groups
A group is said to have a finite covering by subgroups if it is the set theoretic union of finitely many subgroups. A theorem of B. H. Neumann [11] characterizes groups with finite coverings by proper subgroups as precisely those groups with finite non-cyclic homomorphic images. R. Baer (see [13, Theorem 4.16]) proved that a group has a finite covering by abelian subgroups if and only if it is ...
متن کاملOn weakly $mathfrak{F}_{s}$-quasinormal subgroups of finite groups
Let $mathfrak{F}$ be a formation and $G$ a finite group. A subgroup $H$ of $G$ is said to be weakly $mathfrak{F}_{s}$-quasinormal in $G$ if $G$ has an $S$-quasinormal subgroup $T$ such that $HT$ is $S$-quasinormal in $G$ and $(Hcap T)H_{G}/H_{G}leq Z_{mathfrak{F}}(G/H_{G})$, where $Z_{mathfrak{F}}(G/H_{G})$ denotes the $mathfrak{F}$-hypercenter of $G/H_{G}$. In this paper, we study the structur...
متن کاملOn finite $X$-decomposable groups for $X={1, 2, 3, 4}$
Let $mathcal {N}_G$ denote the set of all proper normal subgroups of a group $G$ and $A$ be an element of $mathcal {N}_G$. We use the notation $ncc(A)$ to denote the number of distinct $G$-conjugacy classes contained in $A$ and also $mathcal {K}_G$ for the set ${ncc(A) | Ain mathcal {N}_G}$. Let $X$ be a non-empty set of positive integers. A group $G$ is said to be $X$-d...
متن کاملRamsey Multiplicity of Linear Patterns in Certain Finite Abelian Groups
Abstract. It is well known (and a result of Goodman) that a random 2-colouring of the edges of a large complete graph Kn contains asymptotically (in n) the minimum number of monochromatic triangles (K3s). Erdős conjectured that a random 2-colouring also minimises the number of monochromatic K4s, but his conjecture was disproved by Thomason in 1989. The question of determining for which small gr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: American Journal of Mathematics
سال: 1918
ISSN: 0002-9327
DOI: 10.2307/2370357